Threshold Arrangements and the Knapsack Problem G¨ unter Rote∗ Andr´e Schulz∗

Source URL: wwwmath.uni-muenster.de

MAIN PAPERS OF PAOLO TOTH IN THE PERIOD] P. Toth, “A Dynamic Programming Algorithm for the 0-1 Knapsack Problem”, Computing 25, S. Martello, P.Toth, “Optimal and Canonical Solutions of the

Source URL: www.or.deis.unibo.it

WORKSHOP ON WEB PERSONALIZATION, RECOMMENDER SYSTEMS AND SOCIAL MEDIA, Spoilers Ahead - Personalized Web Filtering Pascal Bissig, Philipp Brandes, Roger Wattenhofer, Roman Willi

Source URL: www.tik.ee.ethz.ch

• Operations research
• Combinatorial optimization
• Cryptography
• Knapsack problem
• Email spam
• Bloom filter

A Knapsack Secretary Problem with Applications Moshe Babaioff1 , Nicole Immorlica2 , David Kempe3 , and Robert Kleinberg4 1

Source URL: www.immorlica.com

ON CERTAIN COMBINATORIAL DIOPHANTINE EQUATIONS AND THEIR CONNECTION TO PYTHAGOREAN NUMBERS ROBERT S. COULTER, MARIE HENDERSON, AND FELIX LAZEBNIK 1. Introduction The binomial knapsack problem is easily stated: determine

Source URL: www.math.udel.edu

Sage Reference Manual: Numerical Optimization Release 6.7 The Sage Development Team

Source URL: doc.sagemath.org

• Operations research
• Dynamic programming
• Cryptography
• Combinatorial optimization
• Knapsack problem
• Subset sum problem
• Sequence
• Exponentiation
• Linear programming
• Mathematics
• Theoretical computer science
• Computational complexity theory

Solving the 0-1 Knapsack Problem with Genetic Algorithms Maya Hristakeva Computer Science Department Simpson College Dipti Shrestha

Source URL: www.assembla.com

• Computational complexity theory
• Crossover
• Knapsack problem
• Fitness proportionate selection
• Mutation
• Chromosome
• Selection
• Bin packing problem
• Population genetics
• Genetic algorithms
• Theoretical computer science
• Applied mathematics

Noname manuscript No. (will be inserted by the editor) Generalizing Cryptosystems Based on the Subset Sum Problem Aniket Kate · Ian Goldberg

Source URL: www.cypherpunks.ca

• Security
• Paillier cryptosystem
• Merkle–Hellman knapsack cryptosystem
• Niederreiter cryptosystem
• Cryptography
• Post-quantum cryptography
• Cryptosystem
• RSA
• Semantic security
• Public-key cryptography
• Cyberwarfare
• Applied mathematics

On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai †

Source URL: www.cs.technion.ac.il

• Operations research
• Combinatorial optimization
• NP-complete problems
• Mathematical optimization
• Dynamic programming
• Knapsack problem
• Job shop scheduling
• Optimization problem
• Polynomial-time approximation scheme
• Theoretical computer science
• Computational complexity theory
• Applied mathematics